Survey of Efficient and Fast Nearest Neighbor Search For Spatial Query on Multidimensional Data
نویسنده
چکیده
Spatial data mining is a special kind of data mining. Patterns, clusters, classifications, etc., can be derived from the big data available. Especially, nearest neighbor search approach with respect to a query point plays a key role in arriving at the final decision making. Like Computer Integrated Manufacturing, Facility Layout, Cellular Manufacturing, nearest neighbor search has been found several applications in searching the nearest hospitals, restaurants, jogging parks, wedding halls, cinema theaters, schools, etc. This paper presents a brief literature review of efficient and fast nearest neighbor search. The older approach is banked upon IR 2 –Tree that usually follows two strategies: R Tree and Signature files. But during the last couple of years, several research papers have been published for fast and efficient nearest neighbor search (FNN) optimizing space; accuracy for handling geometric properties and documents, etc, SI-Index is one of the latest techniques that deal efficiently with multidimensional large scale problems in real time. This paper, therefore, will find interesting to all concerned.
منابع مشابه
Rapid AkNN Query Processing for Fast Classification of Multidimensional Data in the Cloud
A k-nearest neighbor (kNN) query determines the k nearest points, using distance metrics, from a specific location. An all k-nearest neighbor (AkNN) query constitutes a variation of a kNN query and retrieves the k nearest points for each point inside a database. Their main usage resonates in spatial databases and they consist the backbone of many location-based applications and not only (i.e. k...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملFast Nearest-Neighbor Search Algorithms Based on High-Multidimensional Data
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query processing. As recent theoretical results show, state of the art approaches to nearest-neighbor search are not efficient in higher dimensions. In our new approach, we therefore pre-compute the result of any nearest-neighbor s...
متن کاملS Spatial Indexing Techniques
A spatial index is a data structure designed to enable fast access to spatial data. Spatial data come in various forms, the most common being points, lines, and regions in n-dimensional space (practically, nD 2 or 3 in geographical information system (GIS) applications). Typical “selection” queries include the spatial range query (“find all objects that lie within a given query region”) and the...
متن کاملAn efficient nearest neighbor search in high-dimensional data spaces
Similarity search in multimedia databases requires an efficient support of nearest neighbor search on a large set of high-dimensional points. A technique applied for similarity search in multimedia databases is to transform important properties of the multimedia objects into points of a high-dimensional feature space. The feature space is usually indexed using a multidimensional index structure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015